Mean nearest-neighbor distance in random packings of hard D-dimensional spheres.
نویسنده
چکیده
We derive the first nontrivial rigorous bounds on the mean distance between nearest neighbors l in ergodic, isotropic packings of hard D-dimensional spheres that depend on the packing fraction and nearest-neighbor distribution function. Several interesting implications of these bounds for equilibrium as well as nonequilibrium ensembles are explored. For an equilibrium ensemble, we find accurate analytical approximations for l for D 2 and 3 that apply up to random close packing. Our theoretical results are in excellent agreement with available computer-simulation data.
منابع مشابه
Computer Simulations of Nearest-neighbor Distribution Functions and Related Quantities for Hard-sphere Systems
One of the fundamental quantities which statistically characterizes a random system of interacting particles is the nearest-neighbor distribution function. We present computer-simulation results for two different types of nearest-neighbor distribution functions for random distributions of identical impenetrable (hard) spheres. We also report, for such systems, computer-simulation data for close...
متن کاملHard, Soft, and Sticky Spheres for Dynamical Studies of Disordered Colloidal Packings
HARD, SOFT, AND STICKY SPHERES FOR DYNAMICAL STUDIES OF DISORDERED COLLOIDAL PACKINGS Matthew Daniel Gratale Arjun G. Yodh This thesis describes experiments which explore the role of interparticle interactions as a means to alter, and control, the properties of dense colloidal packings. The first set of experiments studied phonon modes in two-dimensional colloidal crystals composed of soft micr...
متن کاملEvaluation Accuracy of Nearest Neighbor Sampling Method in Zagross Forests
Collection of appropriate qualitative and quantitative data is necessary for proper management and planning. Used the suitable inventory methods is necessary and accuracy of sampling methods dependent the inventory net and number of sample point. Nearest neighbor sampling method is a one of distance methods and calculated by three equations (Byth and Riple, 1980; Cotam and Curtis, 1956 and Cota...
متن کاملAnalytical calculation of neighborhood order probabilities for high dimensional Poissonic processes and mean field models
Consider that the coordinates of N points are randomly generated along the edges of a d-dimensional hypercube (random point problem). The probability that an arbitrary point is the mth nearest neighbor to its own nth nearest neighbor (Cox probabilities) plays an important role in spatial statistics. Also, it has been useful in the description of physical processes in disordered media. Here we p...
متن کاملEvaluation Accuracy of Nearest Neighbor Sampling Method in Zagross Forests
Collection of appropriate qualitative and quantitative data is necessary for proper management and planning. Used the suitable inventory methods is necessary and accuracy of sampling methods dependent the inventory net and number of sample point. Nearest neighbor sampling method is a one of distance methods and calculated by three equations (Byth and Riple, 1980; Cotam and Curtis, 1956 and Cota...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review letters
دوره 74 12 شماره
صفحات -
تاریخ انتشار 1995